The conditional metric merge algorithm for maximum likelihood multiuser-macrodiversity detection

نویسندگان

  • Lisa Welburn
  • James K. Cavers
  • Kevin W. Sowerby
چکیده

The combination of macrodiversity reception with maximum likelihood (ML) multiuser detection has the capability to reduce the bit error rate (BER) for many users by several orders of magnitude compared with multiuser detectors that operate on each antenna separately [1]. In this paper, we present the Conditional Metric Merge (CMM) algorithm which reduces the computational complexity of the ML multiuser-macrodiversity detector by an enormous factor. The CMM algorithm can be viewed as a spatial variant of the Viterbi algorithm. It is a new algorithm and is the ¿rst of its kind as ML multiusermacrodiversity detection (MUMD) is a relatively new area of research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new approach to greedy multiuser detection

In this paper, we propose a new suboptimum multiuser detector for synchronous and asynchronous multiuser communications. In this approach, a greedy strategy is used to maximize the cost function, the maximum-likelihood (ML) metric. The coefficients of the ML metric are utilized as weights indicating in which order bits can be estimated. The complexity of the algorithm is approximately 2 log per...

متن کامل

Bearing Fault Detection Based on Maximum Likelihood Estimation and Optimized ANN Using the Bees Algorithm

Rotating machinery is the most common machinery in industry. The root of the faults in rotating machinery is often faulty rolling element bearings. This paper presents a technique using optimized artificial neural network by the Bees Algorithm for automated diagnosis of localized faults in rolling element bearings. The inputs of this technique are a number of features (maximum likelihood estima...

متن کامل

A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems

Optimum multiuser detection for Code Division Multiple Access (CDMA) systems requires the solution of an NPhard combinatorial optimization problem. It is well known that the computational complexity of the optimum multiuser detector is exponential with the number of active users in the system. In order to reduce the complexity of the optimum multiuser detection, we propose a Reduced Complexity ...

متن کامل

Multiuser Detection in DS-CDMA

The theory of Multiuser Detection (MUD) for DS-CDMA is studied. A brief description of optimal MUD is given and some low complexity sub optimal implementations are described. This is followed by a short note on Blind Multiuser detection. Conclusions are drawn from theoretical and simulation results. Towards the end, a new low complexity scheme for MUD in DS-CMDA is proposed. Simulation results ...

متن کامل

Conditional Maximum Likelihood Estimation of the First-Order Spatial Integer-Valued Autoregressive (SINAR(1,1)) Model

‎Recently a first-order Spatial Integer-valued Autoregressive‎ ‎SINAR(1,1) model was introduced to model spatial data that comes‎ ‎in counts citep{ghodsi2012}‎. ‎Some properties of this model‎ ‎have been established and the Yule-Walker estimator has been‎ ‎proposed for this model‎. ‎In this paper‎, ‎we introduce the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001